A Fast Arc Consistency Algorithm for n-ary Constraints
نویسندگان
چکیده
The GAC-Scheme has become a popular general purpose algorithm for solving n-ary constraints, although it may scan an exponential number of supporting tuples. In this paper, we develop a major improvement of this scheme. When searching for a support, our new algorithm is able to skip over a number of tuples exponential in the arity of the constraint by exploiting knowledge about the current domains of the variables. We demonstrate the effectiveness of the method for large table constraints.
منابع مشابه
Arc Consistency on n-ary Monotonic and Linear Constraints
Many problems and applications can be naturally modelled and solved using constraints with more than two variables Such n ary constraints in particular arithmetic constraints are provided by many nite domain constraint programming systems The best known worst case time complexity of existing algorithms GAC schema for enforcing arc consistency on general CSPs is O ed where d is the size of domai...
متن کاملMaintaining Generalized Arc Consistency on Ad-Hoc n-Ary Boolean Constraints
Binary decision diagrams (BDDs) can compactly represent ad-hoc nary Boolean constraints. However, there is no generalized arc consistency (GAC) algorithm which exploit BDDs. For example, the global case constraint by SICStus Prolog for ad-hoc constraints is designed for nonBoolean domains. In this paper, we introduce a new GAC algorithm, bddc, for BDD constraints. Our empirical results demonstr...
متن کاملLocal Consistency for Ternary Numeric Constraints
We consider algorithms of the Waltz type for computing local consistency (also called arc-consistency) for constraints over numeric domains. Many commonly used propagation rules do not in fact enforce local consistency. We extend the propagation rule given by Falt-ings Faltings, 1994] to the case of ternary constraints. Since any general n-ary continuous constraint can be represented as a colle...
متن کاملArc-Consistency for Continuous Variables
Davis 1] has investigated the properties of the Waltz propagation algorithm with interval labels in continuous domains. He shows that in most cases, the algorithm does not achieve arc consistency, and furthermore is subject to innnite iterations. In this paper, I show that the main reason for Davis' negative results lies in the way he formulates the propagation rule for the Waltz algorithm. For...
متن کاملExpensive Constraints and Hyperarc-consistency
We present an arc-consistency algorithm NAC4 to account for some types of non-binary constraints. It di ers from the generalized algorithm GAC4 [ Mohr and Masini, 1988 ] as the constraints need not be modeled as explicit relations but can be retained as implicit n-ary relations. The advantage of this algorithm over GAC4 is pronounced when the checking of constraints is expensive. By an ordering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005